Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems
نویسندگان
چکیده
We prove new lower bounds for suitable competitive ratio measures of two relaxed online packing problems: removable multiple knapsack, and a recently introduced minimum peak appointment scheduling problem. The high level objective in both problems is to pack arriving items sizes at most 1 into bins capacity as efficiently possible, but the exact formalizations differ. In problem, every item has be assigned position, which can seen time interval during workday length 1. That is, are not bins, only once all processed, optimal number subject chosen positions determined, this cost algorithm. On other hand, knapsack problem there fixed goal items, consists choosing particular bin packed (and nothing else), valuable subset possible. last it possible reject that deliberately them, well remove any later point time, adds flexibility
منابع مشابه
Improved Lower Bounds for Online Hypercube Packing
Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing hypercubes into bins in two or more dimensions, once for general algorithms (in two dimensions) and once for an important subclass, so-called Harmonic-type algorithms (in two or more dimensions). Lastly, we show that two adaptions of the ideas from...
متن کاملLower Bounds for Online Algorithms
What is an oline problem Unlike the offline problems that we get the whole input at the beginning, in an online problem we just have some part of the input in advance. The rest of the input are queries that arrive one by one. Upon the arrival of each request, we need to process as it is received. In analyzing online algorithms, we usually, do not really care about the ruing time. The source of ...
متن کاملOptimal Online Algorithms for Multidimensional Packing Problems
We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing that uses only bounded space. To achieve this, we introduce a new technique for classifying the items to be packed. We show that our algorithm is optimal among bounded space algorithms for any dimension d > 1. Its asymptotic performance ratio is (Π∞) , where Π∞ ≈ 1.691 is the asymptotic ...
متن کاملComparing online algorithms for bin packing problems
The relative worst-order ratio is a measure of the quality of online algorithms. In contrast to the competitive ratio, this measure compares two online algorithms directly instead of using an intermediate comparison with an optimal offline algorithm. In this paper, we apply the relative worst-order ratio to online algorithms for several common variants of the bin packing problem. We mainly cons...
متن کاملLower bounds for several online variants of bin packing
We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-06678-8_8